Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk)
نویسنده
چکیده
Data sets that have been collected from multiple sources or extracted from the web or often highly incomplete and heterogeneous, which makes them hard to process and query. One way to address this challenge is to use ontologies, which provide a way to assign a semantics to the data, to enrich it with domain knowledge, and to provide an enriched and uniform vocabulary for querying. The combination of a traditional database query with an ontology is called an ontology-mediated query (OMQ). The aim of this talk is to survey fundamental properties of OMQs such as their complexity, expressive power, descriptive strength, and rewritability into traditional query languages such as SQL and Datalog. A central observation is that there is a close and fruitful connection between OMQs and constraint satisfaction problems (CSPs) as well as related fragments of monadic NP, which puts OMQs into a more general perspective and gives raise to a number of interesting results. 1998 ACM Subject Classification H.2.3 Database Management, Query Languages
منابع مشابه
Graph Queries: Generation, Evaluation and Learning (Invited Talk)
Several modern graph query languages are capable of expressing sophisticated graph queries, which return nodes connected by arbitrarily complex paths. Such paths can be synthesized by regular expressions and often involve recursion. Such graph queries are known as Regular Path Queries and correspond to Property Paths in Sparql 1.1. Recently, with my colleagues I have been investigating regular ...
متن کاملRewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk)
We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability into FO and into monadic Datalog (MDLog) are decidable, and that rewritability into Datalog is decidable when the original query satisfies a certa...
متن کاملData Complexity of Query Answering in Expressive Description Logics with Nominals
The formal foundations of the standard web ontology languages, OWL-Lite and OWLDL, are provided by expressive Description Logics (DLs), such as SHIF and SHOIQ. In the Semantic Web and other domains, ontologies are increasingly seen also as a mechanism to access and query data repositories. This novel context poses an original combination of challenges that has not been addressed before: (i) suf...
متن کاملQuery Rewriting Beyond DL-Lite
Query rewriting has become a very prominent tool for efficiently implementing ontology-mediated querying in practice. The technique was originally introduced in the context of DL-Lite [4], but is now increasingly being used also for more expressive DLs. While rewritings are not guaranteed to exist beyond DL-Lite, the simple structure of ontologies that emerge from practical applications gives h...
متن کاملPolynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics
Rewriting ontology mediated queries (OMQs) into traditional query languages like FO-queries and Datalog is central for understanding their relative expressiveness, and plays a crucial role in the ongoing efforts to develop OMQ answering tools by reusing existing database technologies. However, the vast majority of works focus on Horn ontologies, and for OMQs where the ontologies are written in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016